00_queue

01_introduction_from_stack_to_que

02_queue_definition_and_core_oper

03_naive_implementation_array_bas

04_the_problem_false_overflow

05_demonstrating_the_index_wrappi

06_circular_logic_the_modulo_oper

07_distinguishing_full_vs_empty_s

08_circular_implementation_detail

09_real_world_application_printer

10_summary_stack_vs_queue

Your Personal AI Tutor

Ask me anything! Here are some ideas to get started:

Understand Concepts

Ask me to explain the current slide or a concept in simple terms.

"Explain recursion in simple terms." "What is a `Class`?"

Generate Code

Request code examples in different programming languages.

"Binary search example in Python" "How to implement adjacency list in C"

Use Your Tone and Language

Ask in different languages or tones and I'll adapt.

"What does acyclic mean" "呢張slide入面個符號g代表咩" "这里`Heap`的中文是什么"

The AI assistant can make mistakes, verify important info.